Systems and methods for performing 16-bit floating-point vector dot product instructions

ABSTRACT

Disclosed embodiments relate to systems and methods for performing 16-bit floating-point vector dot product instructions. In one example, a processor includes fetch circuitry to fetch an instruction having fields to specify an opcode and locations of first source, second source, and destination vectors, the opcode to indicate execution circuitry is to multiply N pairs of 16-bit floating-point formatted elements of the specified first and second sources, and accumulate the resulting products with previous contents of a corresponding single-precision element of the specified destination, decode circuitry to decode the fetched instruction, and execution circuitry to respond to the decoded instruction as specified by the opcode.

FIELD OF THE INVENTION

The field of invention relates generally to computer processorarchitecture, and, more specifically, to systems and methods forperforming 16-bit floating-point vector dot product instructions.

BACKGROUND

An instruction set, or instruction set architecture (ISA), is the partof the computer architecture related to programming, and may include thenative data types, instructions, register architecture, addressingmodes, memory architecture, interrupt and exception handling, andexternal input and output (I/O). An instruction set includes one or moreinstruction formats. A given instruction format defines various fields(number of bits, location of bits) to specify, among other things, theoperation to be performed and the operand(s) on which that operation isto be performed. A given instruction is expressed using a giveninstruction format and specifies the operation and the operands. Aninstruction stream is a specific sequence of instructions, where eachinstruction in the sequence is an occurrence of an instruction in aninstruction format.

Scientific, financial, auto-vectorized general purpose, RMS(recognition, mining, and synthesis)/visual and multimedia applications(e.g., 2D/3D graphics, image processing, videocompression/decompression, voice recognition algorithms and audiomanipulation) often require the same operation to be performed on alarge number of data items (referred to as “data parallelism”). SingleInstruction Multiple Data (SIMD) refers to a type of instruction thatcauses a processor to perform the same operation on multiple data items.SIMD technology is especially suited to processors that can logicallydivide the bits in a register into a number of fixed-sized dataelements, each of which represents a separate value. For example, thebits in a 512-bit register may be specified as a source operand to beoperated on as sixteen separate 32-bit single-precision floating-pointdata elements. As another example, the bits in a 256-bit register may bespecified as a source operand to be operated on as sixteen separate16-bit floating-point packed data elements, eight separate 32-bit packeddata elements (double word size data elements), or thirty-two separate8-bit data elements (byte (B) size data elements). This type of data isreferred to as the packed data type or vector data type, and operands ofthis data type are referred to as packed data operands or vectoroperands. In other words, a packed data item or vector refers to asequence of packed data elements; and a packed data operand or a vectoroperand is a source or destination operand of a SIMD instruction (alsoknown as a packed data instruction or a vector instruction).

By way of example, one type of SIMD instruction specifies a singlevector operation to be performed on two source vector operands in avertical fashion to generate a destination vector operand of the samesize, with the same number of data elements, and in the same dataelement order. The data elements in the source vector operands arereferred to as source data elements, while the data elements in thedestination vector operand are referred to a destination or result dataelements. These source vector operands are of the same size and containdata elements of the same width, and thus they contain the same numberof data elements. The source data elements in the same bit positions inthe two source vector operands form pairs of data elements (alsoreferred to as corresponding data elements; that is, the data element indata element position 0 of each source operand correspond, the dataelement in data element position 1 of each source operand correspond,and so on). The operation specified by that SIMD instruction isperformed separately on each of these pairs of source data elements togenerate a matching number of result data elements, and thus each pairof source data elements has a corresponding result data element. Sincethe operation is vertical and since the result vector operand is thesame size, has the same number of data elements, and the result dataelements are stored in the same data element order as the source vectoroperands, the result data elements are in the same bit positions of theresult vector operand as their corresponding pair of source dataelements in the source vector operands. In addition to this exemplarytype of SIMD instruction, there are a variety of other types of SIMDinstructions.

Dot product multiplication of vectors containing 16-bit floating-pointelements is useful in a number of algorithms that perform themultiplication on 16-bit sources and accumulate the multiplicationresults with 32-bit destination vector elements.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram illustrating processing components forexecuting a VDPBF16PS instruction, according to an embodiment;

FIG. 2 is a block diagram illustrating execution of a VDPBF16PSinstruction, according to an embodiment;

FIG. 3A is pseudocode illustrating exemplary execution of a VDPBF16PSinstruction, according to an embodiment;

FIG. 3B is pseudocode illustrating exemplary execution of a VDPBF16PSinstruction, according to an embodiment;

FIG. 3C is pseudocode illustrating a helper function for use with thepseudocode of FIGS. 3A and 3B, according to an embodiment;

FIG. 4 is a process flow diagram illustrating a processor responding toa VDPBF16PS instruction, according to an embodiment;

FIG. 5 is a block diagram illustrating a format of a VDPBF16PSinstruction, according to an embodiment;

FIGS. 6A-6B are block diagrams illustrating a generic vector friendlyinstruction format and instruction templates thereof according to someembodiments of the invention;

FIG. 6A is a block diagram illustrating a generic vector friendlyinstruction format and class A instruction templates thereof accordingto some embodiments of the invention;

FIG. 6B is a block diagram illustrating the generic vector friendlyinstruction format and class B instruction templates thereof accordingto some embodiments of the invention;

FIG. 7A is a block diagram illustrating an exemplary specific vectorfriendly instruction format according to some embodiments of theinvention;

FIG. 7B is a block diagram illustrating the fields of the specificvector friendly instruction format that make up the full opcode fieldaccording to one embodiment;

FIG. 7C is a block diagram illustrating the fields of the specificvector friendly instruction format that make up the register index fieldaccording to one embodiment;

FIG. 7D is a block diagram illustrating the fields of the specificvector friendly instruction format that make up the augmentationoperation field according to one embodiment;

FIG. 8 is a block diagram of a register architecture according to oneembodiment;

FIG. 9A is a block diagram illustrating both an exemplary in-orderpipeline and an exemplary register renaming, out-of-orderissue/execution pipeline according to some embodiments;

FIG. 9B is a block diagram illustrating both an exemplary embodiment ofan in-order architecture core and an exemplary register renaming,out-of-order issue/execution architecture core to be included in aprocessor according to some embodiments;

FIGS. 10A-B illustrate a block diagram of a more specific exemplaryin-order core architecture, which core would be one of several logicblocks (including other cores of the same type and/or different types)in a chip;

FIG. 10A is a block diagram of a single processor core, along with itsconnection to the on-die interconnect network and with its local subsetof the Level 2 (L2) cache, according to some embodiments;

FIG. 10B is an expanded view of part of the processor core in FIG. 10Aaccording to some embodiments;

FIG. 11 is a block diagram of a processor that may have more than onecore, may have an integrated memory controller, and may have integratedgraphics according to some embodiments;

FIGS. 12-15 are block diagrams of exemplary computer architectures;

FIG. 12 shown a block diagram of a system in accordance with someembodiments;

FIG. 13 is a block diagram of a first more specific exemplary system inaccordance with some embodiment;

FIG. 14 is a block diagram of a second more specific exemplary system inaccordance with some embodiments;

FIG. 15 is a block diagram of a System-on-a-Chip (SoC) in accordancewith some embodiments; and

FIG. 16 is a block diagram contrasting the use of a software instructionconverter to convert binary instructions in a source instruction set tobinary instructions in a target instruction set according to someembodiments.

DETAILED DESCRIPTION OF THE EMBODIMENTS

In the following description, numerous specific details are set forth.However, it is understood that some embodiments may be practiced withoutthese specific details. In other instances, well-known circuits,structures and techniques have not been shown in detail in order not toobscure the understanding of this description.

References in the specification to “one embodiment,” “an embodiment,”“an example embodiment,” etc., indicate that the embodiment describedmay include a feature, structure, or characteristic, but everyembodiment may not necessarily include the feature, structure, orcharacteristic. Moreover, such phrases are not necessarily referring tothe same embodiment. Further, when a feature, structure, orcharacteristic is described about an embodiment, it is submitted that itis within the knowledge of one skilled in the art to affect suchfeature, structure, or characteristic about other embodiments ifexplicitly described.

As mentioned above, dot product multiplication of vectors containing16-bit floating-point elements, accumulating the results with 32-bitdestination vector elements, is useful in a number of algorithms.Disclosed herein and illustrated by way of the figures is a vectorpacked data instruction (VDPBF16PS, a mnemonic indicating“VDP”=VDPBF16PS Vector Dot Product, “BF16”=sources formatted asBFloat16, accumulate products to Packed Single-precision) thatimplements dot product multiplication of pairs of 16-bit floating-pointelements in two source vectors. The instruction takes two source vectorshaving pairs of bfloat16 values per element (i.e., pairs of 16-bitelements make 32-bit source elements) and generates a destination vectorhaving single-precision elements (i.e., also 32 bits, so source anddestination registers are balanced). The multiply output is 32-bits andis saturated and accumulated with previous contents of the destinationregister.

As compared to algorithms that use single-precision for both the sourceand destination elements, the disclosed VDPBF16PS instruction isexpected to achieve comparable quality, but with reduced memoryutilization and memory bandwidth requirements, which would serve toimprove performance and power efficiency, especially in a machinelearning context.

As mentioned above, the disclosed VDPBF16PS instruction performs dotproduct operations on vectors by multiplying 16-bit floating-point (e.g.bfloat16) elements of two source registers and accumulating the resultsin a single-precision destination vector. Without the disclosedVDPBF16PS instruction, performing this functionality with existinginstructions would require a sequence of instructions to convert thedata elements, perform multiplies, and accumulate the multiplicationresults with the destination data with saturation. Instead, thedisclosed embodiments implement this functionality in one instruction.

Relevant Floating-Point Formats

16-bit floating-point formats used by disclosed embodiments includebfloat16 (defined by Google, Inc., of Mountain View, Calif.), which issometimes referred to herein as “bf16” or “BF16,” and binary16(promulgated as IEEE754-2008 by the institute of Electrical andElectronics Engineers), which is sometimes referred to herein as“half-precision” or “fp16.” 32-bit floating-point formats used bydisclosed embodiments include binary32 (also promulgated as part ofIEEE754-2008), which is sometimes referred to herein as“single-precision” or “fp32.”

Table 1 lists some relevant characteristics and distinctions among therelevant data formats. As shown, all three formats include one sign bit.The binary32, binary16, and bfloat16 have exponent widths of 8 bits, 5bits, and 8 bits, respectively, and significand (sometimes referred toherein as “mantissa” or “fraction”) bits of 24 bits, 11 bits, and 8bits, respectively. To make room to fit the significand, each of thebinary32, binary16, and bfloat16 formats uses one implicit bit for thesignificand, the remaining bits of the significand being expresslyincluded. One advantage of bfloat16 over fp16 is that one can truncatefp32 numbers and have a valid bfloat16 number.

TABLE 1 Format Bits Sign Exponent Significand Binary32 32 1 8 bits 24bits Binary16 16 1 5 bits 11 bits Bfloat16 16 1 8 bits  8 bits

A processor implementing the disclosed VDPBF16PS instruction wouldinclude fetch circuitry to fetch an instruction having fields to specifyan opcode and locations of first source, second source, and destinationvectors. The format of the VDPBF16PS instruction is further illustratedand described at least with respect to FIGS. 5, 6A-B, and 7A-D. Thespecified source and destination vectors may be located in vectorregisters or in memory. The opcode is to cause the processor to multiplyN pairs of 16-bit floating-point formatted (e.g., bfloat16) elements ofthe specified first and second sources, where N in some embodiments anyone of 4, 8, and 16 (but the invention does not place an upper limit onN, which could be 32, 64, or larger, and associated with source vectorshaving 1024, 2048, or more bits. In some embodiments, N is an evennumber larger than 4.) and accumulate each of the resulting productswith previous contents of a corresponding single-precision (i.e., FP32or binary32) element of the specified destination. Such a processorwould further include decode circuitry to decode the fetchedinstruction, and execution circuitry to respond to the decodedinstruction as specified by the opcode. Execution circuitry is furtherdescribed and illustrated below, at least at least with respect to FIGS.1-4, 9A-B and 10A-B.

FIG. 1 is a block diagram illustrating processing components forexecuting a VDPBF16PS instruction, according to some embodiments. Asillustrated, storage 101 stores VDPBF16PS instruction(s) 103 to beexecuted. In some embodiments, computing system 100 is a SIMD processorto concurrently process multiple elements of packed-data vectors, suchas matrices.

In operation, the VDPBF16PS instruction(s) 103 is fetched from storage101 by fetch circuitry 105. As is described further below, at least withrespect to FIGS. 2 and 5, the VDPBFPBF16 instruction has fields tospecify an opcode and locations of first source, second source, anddestination vectors, the opcode to indicate execution circuitry is tomultiply N pairs of 16-bit floating-point formatted elements of thespecified first and second sources, and accumulate the resultingproducts with previous contents of a corresponding single-precisionelement of the specified destination. The fetched VDPBF16PS instruction107 is decoded by decode circuitry 109. The VDPBF16PS instructionformat, which is further illustrated and described at least with respectto FIGS. 5, 6A-B, and 7A-D, has fields (not shown here) to specifylocations of first source, second source, and destination vectors.Decode circuitry 109 decodes the fetched VDPBF16PS instruction 107 intoone or more operations. In some embodiments, this decoding includesgenerating a plurality of micro-operations to be performed by executioncircuitry (such as execution circuitry 117). Decode circuitry 109 alsodecodes instruction suffixes and prefixes (if used). Execution circuitry117, which has access to register file and memory 115, is to respond todecoded instruction 111 as specified by the opcode, and is furtherdescribed and illustrated below, at least with respect to FIGS. 3-4,9A-B and 10A-B.

In some embodiments, register renaming, register allocation, and/orscheduling circuit 113 provides functionality for one or more of: 1)renaming logical operand values to physical operand values (e.g., aregister alias table in some embodiments), 2) allocating status bits andflags to the decoded instruction, and 3) scheduling the decodedVDPBF16PS instruction 111 for execution on execution circuitry 117 outof an instruction pool (e.g., using a reservation station in someembodiments).

In some embodiments, writeback circuit 119 is to write back results ofthe executed instruction. Writeback circuit 119 and registerrename/scheduling circuit 113 are optional, as indicated by their dashedborders, insofar as they may occur at different times, or not at all.

FIG. 2 is a block diagram illustrating execution of a VDPBF16PSinstruction, according to an embodiment. As shown, computing apparatus200 (e.g., a processor) is to receive, fetch, and decode (fetch anddecode circuitry not shown here, but are illustrated and described atleast with respect to FIG. 1 and FIGS. 9A-B) VDPBF16PS instruction 201,which includes fields to specify opcode 202 (VDPBF16PS) and locations ofdestination 204, first source 206, and second source 208 vectors. Theformat of VDPBF16PS instruction 201 is further illustrated and describedat least with respect to FIGS. 5, 6A-B, and 7A-D. Also shown arespecified first and second source vectors 212A and 212B, executioncircuitry 214, which includes multipliers 215A, 215B and accumulator216, and specified destination vector 218.

In operation, computing apparatus 200 (e.g., a processor), is to fetchand decode, using fetch and decode circuitry (not shown), instruction201 having fields to specify opcode 202 and locations of first source206, second source 208, and destination 204 vectors, the opcode toindicate the computing apparatus (e.g., processor) is to multiply Npairs of 16-bit floating-point (e.g., bfloat16 or binary16) elements ofthe specified first and second sources, and accumulate the resultingproducts with previous contents of a corresponding single-precision(e.g., binary32) element of the specified destination. Here, N is shownas equaling 8, so the specified first and second sources are 256-bitvectors, which can be located either in vector registers or in memory,which contain 8 pairs of 16-bit floating-point formatted numbers. As isfurther illustrated and described at least with respect to FIGS. 5,6A-B, and 7A-D, instruction 201 in other embodiments can specifydifferent vector lengths, such as 128 bits, 512 bits, or 1024 bits.Execution circuitry 214 here is to respond to the decoded instruction asspecified by opcode 202. In some embodiments, execution circuitry 214performs saturation, as needed, on the results of multipliers 215A and215B, and accumulator 216. In some embodiments, execution circuitryperforms the multiplications with infinite precision without saturationand saturates the results of the accumulation to plus or minus infinityin case of an overflow and to zero in case of any underflow. In someembodiments, execution circuitry 214 is to generate all N destinationelements in parallel.

FIG. 3A is pseudocode illustrating exemplary execution of a VDPBF16PSinstruction, according to an embodiment. As shown in pseudocode 300,VDPBF16PS function has fields to specify first and second source vectorssrc1 and src2, which can be any of 128 bits, 256 bits, and 512 bits, anda destination, srcdest, which also serves as a source for theaccumulation. Pseudocode 300 also shows use of a writemask to controlwhether to mask each of the destination elements, with masked elementsbeing either zeroed or merged. (As is further illustrated and describedat least with respect to FIGS. 5, 6A-B, and 7A-D, the VDPBF16PSinstruction in some embodiments includes fields to specify the mask andto control whether to zero or merge.) Execution of the VDPBF16PSinstruction is further illustrated and described at least with respectto FIGS. 2, 3B, 4, and 9A-B.

FIG. 3B is pseudocode illustrating exemplary execution of a VDPBF16PSinstruction, according to an embodiment. As shown, pseudocode 310 issimilar to pseudocode 300 (FIG. 3A) but accumulates the product of theodd source elements with the destination before that of the evenelements.

FIG. 3C is pseudocode illustrating a helper function for use with thepseudocode of FIG. 3A, according to an embodiment. Here, pseudocode 320defines a helper function, make_fp32(x), which converts from a bfloat16format to a binary32 format. The code illustrates at least one advantageof bfloat16 format over binary16 or half-precision format, namely, theconversion can simply pack the 16 bits of the bfloat16 number into theupper 16 bits of a doubleword, zeroing the lower 16 bits. The reverseconversion can be performed by just truncating the lower 16 bits of thebinary32 number.

FIG. 4 is a process flow diagram illustrating a processor responding toa VDPBF16PS instruction, according to an embodiment. As shown in flow400, at 401, the processor is to fetch, using fetch circuitry, aninstruction having fields to specify an opcode and locations of firstsource, second source, and destination vectors, the opcode to indicateexecution circuitry is to multiply N pairs of half-precision elements ofthe specified first and second sources, and accumulate the resultingproducts with previous contents of a corresponding single-precisionelement of the specified destination. At 403, the processor is todecode, using decode circuitry, the fetched instruction. In someembodiments, at 405, the processor is to schedule execution of thedecoded instruction as specified by the opcode. At 407, the processor isto respond, using execution circuitry, to the decoded instruction. Insome embodiments, the execution circuitry is to saturate results of themultiplications and accumulation, as needed. In some embodiments,execution circuitry performs the multiplications with infinite precisionwithout saturation and saturates the results of the accumulation to plusor minus infinity in case of an overflow and to zero in case of anyunderflow. In some embodiments, at 409, the processor is to commit aresult of the executed instruction.

Operations 405 and 409 are optional, as indicated by their dashedborders, insofar as they might occur at a different time, or not at all.

FIG. 5 is a block diagram illustrating a format of a VDPBF16PSinstruction, according to an embodiment. As shown, VDPBF16PS instruction500 includes fields for specifying an opcode 502, and locations ofdestination 504, first source 506, and second source 508 vectors. Thesource and destination vectors can each be located in registers or inmemory. An example of opcode 502 is VDPBF16PS*.

Opcode 502 is shown including an asterisk, which signifies that variousoptional fields can be added as prefixes or suffixes to the opcode.Namely, VDPBF16PS Instruction 500 further includes optional parametersto affect instruction behavior, including mask {k} 510, zeroing {Z} 512,element format 514, and vector size (N) 516. One or more of instructionmodifiers 510, 512, 514, and 516 may be specified using prefixes orsuffixes to opcode 502.

In some embodiments, one or more of optional instruction modifiers 510,512, 514, and 516 are encoded in an immediate field (not shown)optionally included with the instruction 500. For example, each ofoptional instruction modifiers 510, 512, 514, and 516 can be indicatedby a different 8-bit portion of a 32-bit immediate. In some embodiments,one or more of optional instructions modifiers 510, 512, 514, and 516 isspecified via a configuration register, such as model-specific registers(MSRs) included in the instruction set architecture.

The format of VDPBF16PS Instruction 500 is further illustrated anddescribed, at least with respect to FIGS. 6A-B and 7A-D.

Instruction Sets

An instruction set may include one or more instruction formats. A giveninstruction format may define various fields (e.g., number of bits,location of bits) to specify, among other things, the operation to beperformed (e.g., opcode) and the operand(s) on which that operation isto be performed and/or other data field(s) (e.g., mask). Someinstruction formats are further broken down though the definition ofinstruction templates (or subformats). For example, the instructiontemplates of a given instruction format may be defined to have differentsubsets of the instruction format's fields (the included fields aretypically in the same order, but at least some have different bitpositions because there are less fields included) and/or defined to havea given field interpreted differently. Thus, each instruction of an ISAis expressed using a given instruction format (and, if defined, in agiven one of the instruction templates of that instruction format) andincludes fields for specifying the operation and the operands. Forexample, an exemplary ADD instruction has a specific opcode and aninstruction format that includes an opcode field to specify that opcodeand operand fields to select operands (source1/destination and source2);and an occurrence of this ADD instruction in an instruction stream willhave specific contents in the operand fields that select specificoperands. A set of SIMD extensions referred to as the Advanced VectorExtensions (AVX) (AVX1 and AVX2) and using the Vector Extensions (VEX)coding scheme has been released and/or published (e.g., see Intel® 64and IA-32 Architectures Software Developer's Manual, September 2014; andsee Intel® Advanced Vector Extensions Programming Reference, October2014).

Exemplary Instruction Formats

Embodiments of the instruction(s) described herein may be embodied indifferent formats. Additionally, exemplary systems, architectures, andpipelines are detailed below. Embodiments of the instruction(s) may beexecuted on such systems, architectures, and pipelines, but are notlimited to those detailed.

Generic Vector Friendly Instruction Format

A vector friendly instruction format is an instruction format that issuited for vector instructions (e.g., there are certain fields specificto vector operations). While embodiments are described in which bothvector and scalar operations are supported through the vector friendlyinstruction format, alternative embodiments use only vector operationsthe vector friendly instruction format.

FIGS. 6A-6B are block diagrams illustrating a generic vector friendlyinstruction format and instruction templates thereof according to someembodiments of the invention. FIG. 6A is a block diagram illustrating ageneric vector friendly instruction format and class A instructiontemplates thereof according to some embodiments of the invention; whileFIG. 6B is a block diagram illustrating the generic vector friendlyinstruction format and class B instruction templates thereof accordingto some embodiments of the invention. Specifically, a generic vectorfriendly instruction format 600 for which are defined class A and classB instruction templates, both of which include no memory access 605instruction templates and memory access 620 instruction templates. Theterm generic in the context of the vector friendly instruction formatrefers to the instruction format not being tied to any specificinstruction set.

While embodiments of the invention will be described in which the vectorfriendly instruction format supports the following: a 64 byte vectoroperand length (or size) with 32 bit (4 byte) or 64 bit (8 byte) dataelement widths (or sizes) (and thus, a 64 byte vector consists of either16 doubleword-size elements or alternatively, 8 quadword-size elements);a 64 byte vector operand length (or size) with 16 bit (2 byte) or 8 bit(1 byte) data element widths (or sizes); a 32 byte vector operand length(or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit (2 byte), or 8bit (1 byte) data element widths (or sizes); and a 16 byte vectoroperand length (or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit(2 byte), or 8 bit (1 byte) data element widths (or sizes); alternativeembodiments may support more, less and/or different vector operand sizes(e.g., 256 byte vector operands) with more, less, or different dataelement widths (e.g., 128 bit (16 byte) data element widths).

The class A instruction templates in FIG. 6A include: 1) within the nomemory access 605 instruction templates there is shown a no memoryaccess, full round control type operation 610 instruction template and ano memory access, data transform type operation 615 instructiontemplate; and 2) within the memory access 620 instruction templatesthere is shown a memory access, temporal 625 instruction template and amemory access, non-temporal 630 instruction template. The class Binstruction templates in FIG. 6B include: 1) within the no memory access605 instruction templates there is shown a no memory access, write maskcontrol, partial round control type operation 612 instruction templateand a no memory access, write mask control, vsize type operation 617instruction template; and 2) within the memory access 620 instructiontemplates there is shown a memory access, write mask control 627instruction template.

The generic vector friendly instruction format 600 includes thefollowing fields listed below in the order illustrated in FIGS. 6A-6B.

Format field 640—a specific value (an instruction format identifiervalue) in this field uniquely identifies the vector friendly instructionformat, and thus occurrences of instructions in the vector friendlyinstruction format in instruction streams. As such, this field isoptional in the sense that it is not needed for an instruction set thathas only the generic vector friendly instruction format.

Base operation field 642—its content distinguishes different baseoperations.

Register index field 644—its content, directly or through addressgeneration, specifies the locations of the source and destinationoperands, be they in registers or in memory. These include a sufficientnumber of bits to select N registers from a P×Q (e.g. 32×512, 16×128,32×1024, 64×1024) register file. While in one embodiment N may be up tothree sources and one destination register, alternative embodiments maysupport more or less sources and destination registers (e.g., maysupport up to two sources where one of these sources also acts as thedestination, may support up to three sources where one of these sourcesalso acts as the destination, may support up to two sources and onedestination).

Modifier field 646—its content distinguishes occurrences of instructionsin the generic vector instruction format that specify memory access fromthose that do not; that is, between no memory access 605 instructiontemplates and memory access 620 instruction templates. Memory accessoperations read and/or write to the memory hierarchy (in some casesspecifying the source and/or destination addresses using values inregisters), while non-memory access operations do not (e.g., the sourceand destinations are registers). While in one embodiment this field alsoselects between three different ways to perform memory addresscalculations, alternative embodiments may support more, less, ordifferent ways to perform memory address calculations.

Augmentation operation field 650—its content distinguishes which one ofa variety of different operations to be performed in addition to thebase operation. This field is context specific. In some embodiments,this field is divided into a class field 668, an alpha field 652, and abeta field 654. The augmentation operation field 650 allows commongroups of operations to be performed in a single instruction rather than2, 3, or 4 instructions.

Scale field 660—its content allows for the scaling of the index field'scontent for memory address generation (e.g., for address generation thatuses 2^(scale)*index+base).

Displacement Field 662A—its content is used as part of memory addressgeneration (e.g., for address generation that uses2^(scale)*index+base+displacement).

Displacement Factor Field 662B (note that the juxtaposition ofdisplacement field 662A directly over displacement factor field 662Bindicates one or the other is used)—its content is used as part ofaddress generation; it specifies a displacement factor that is to bescaled by the size of a memory access (N)—where N is the number of bytesin the memory access (e.g., for address generation that uses2^(scale)*index+base+scaled displacement). Redundant low-order bits areignored and hence, the displacement factor field's content is multipliedby the memory operands total size (N) in order to generate the finaldisplacement to be used in calculating an effective address. The valueof N is determined by the processor hardware at runtime based on thefull opcode field 674 (described later herein) and the data manipulationfield 654C. The displacement field 662A and the displacement factorfield 662B are optional in the sense that they are not used for the nomemory access 605 instruction templates and/or different embodiments mayimplement only one or none of the two.

Data element width field 664—its content distinguishes which one of anumber of data element widths is to be used (in some embodiments for allinstructions; in other embodiments for only some of the instructions).This field is optional in the sense that it is not needed if only onedata element width is supported and/or data element widths are supportedusing some aspect of the opcodes.

Write mask field 670—its content controls, on a per data elementposition basis, whether that data element position in the destinationvector operand reflects the result of the base operation andaugmentation operation. Class A instruction templates supportmerging-writemasking, while class B instruction templates support bothmerging- and zeroing-writemasking. When merging, vector masks allow anyset of elements in the destination to be protected from updates duringthe execution of any operation (specified by the base operation and theaugmentation operation); in other one embodiment, preserving the oldvalue of each element of the destination where the corresponding maskbit has a 0. In contrast, when zeroing vector masks allow any set ofelements in the destination to be zeroed during the execution of anyoperation (specified by the base operation and the augmentationoperation); in one embodiment, an element of the destination is set to 0when the corresponding mask bit has a 0 value. A subset of thisfunctionality is the ability to control the vector length of theoperation being performed (that is, the span of elements being modified,from the first to the last one); however, it is not necessary that theelements that are modified be consecutive. Thus, the write mask field670 allows for partial vector operations, including loads, stores,arithmetic, logical, etc. While embodiments of the invention aredescribed in which the write mask field's 670 content selects one of anumber of write mask registers that contains the write mask to be used(and thus the write mask field's 670 content indirectly identifies thatmasking to be performed), alternative embodiments instead or additionalallow the mask write field's 670 content to directly specify the maskingto be performed.

Immediate field 672—its content allows for the specification of animmediate. This field is optional in the sense that is it not present inan implementation of the generic vector friendly format that does notsupport immediate and it is not present in instructions that do not usean immediate.

Class field 668—its content distinguishes between different classes ofinstructions. With reference to FIGS. 6A-B, the contents of this fieldselect between class A and class B instructions. In FIGS. 6A-B, roundedcorner squares are used to indicate a specific value is present in afield (e.g., class A 668A and class B 668B for the class field 668respectively in FIGS. 6A-B).

Instruction Templates of Class A

In the case of the non-memory access 605 instruction templates of classA, the alpha field 652 is interpreted as an RS field 652A, whose contentdistinguishes which one of the different augmentation operation typesare to be performed (e.g., round 652A.1 and data transform 652A.2 arerespectively specified for the no memory access, round type operation610 and the no memory access, data transform type operation 615instruction templates), while the beta field 654 distinguishes which ofthe operations of the specified type is to be performed. In the nomemory access 605 instruction templates, the scale field 660, thedisplacement field 662A, and the displacement scale filed 662B are notpresent.

No-Memory Access Instruction Templates-Full Round Control Type Operation

In the no memory access full round control type operation 610instruction template, the beta field 654 is interpreted as a roundcontrol field 654A, whose content(s) provide static rounding. While inthe described embodiments of the invention the round control field 654Aincludes a suppress all floating-point exceptions (SAE) field 656 and around operation control field 658, alternative embodiments may supportmay encode both these concepts into the same field or only have one orthe other of these concepts/fields (e.g., may have only the roundoperation control field 658).

SAE field 656—its content distinguishes whether or not to disable theexception event reporting; when the SAE field's 656 content indicatessuppression is enabled, a given instruction does not report any kind offloating-point exception flag and does not raise any floating-pointexception handler.

Round operation control field 658—its content distinguishes which one ofa group of rounding operations to perform (e.g., Round-up, Round-down,Round-towards-zero and Round-to-nearest). Thus, the round operationcontrol field 658 allows for the changing of the rounding mode on a perinstruction basis. In some embodiments where a processor includes acontrol register for specifying rounding modes, the round operationcontrol field's 650 content overrides that register value.

No Memory Access Instruction Templates-Data Transform Type Operation

In the no memory access data transform type operation 615 instructiontemplate, the beta field 654 is interpreted as a data transform field654B, whose content distinguishes which one of a number of datatransforms is to be performed (e.g., no data transform, swizzle,broadcast).

In the case of a memory access 620 instruction template of class A, thealpha field 652 is interpreted as an eviction hint field 652B, whosecontent distinguishes which one of the eviction hints is to be used (inFIG. 6A, temporal 652B.1 and non-temporal 652B.2 are respectivelyspecified for the memory access, temporal 625 instruction template andthe memory access, non-temporal 630 instruction template), while thebeta field 654 is interpreted as a data manipulation field 654C, whosecontent distinguishes which one of a number of data manipulationoperations (also known as primitives) is to be performed (e.g., nomanipulation; broadcast; up conversion of a source; and down conversionof a destination). The memory access 620 instruction templates includethe scale field 660, and optionally the displacement field 662A or thedisplacement scale field 662B.

Vector memory instructions perform vector loads from and vector storesto memory, with conversion support. As with regular vector instructions,vector memory instructions transfer data from/to memory in a dataelement-wise fashion, with the elements that are actually transferred isdictated by the contents of the vector mask that is selected as thewrite mask.

Memory Access Instruction Templates-Temporal

Temporal data is data likely to be reused soon enough to benefit fromcaching. This is, however, a hint, and different processors mayimplement it in different ways, including ignoring the hint entirely.

Memory Access Instruction Templates-Non-Temporal

Non-temporal data is data unlikely to be reused soon enough to benefitfrom caching in the 1st-level cache and should be given priority foreviction. This is, however, a hint, and different processors mayimplement it in different ways, including ignoring the hint entirely.

Instruction Templates of Class B

In the case of the instruction templates of class B, the alpha field 652is interpreted as a write mask control (Z) field 652C, whose contentdistinguishes whether the write masking controlled by the write maskfield 670 should be a merging or a zeroing.

In the case of the non-memory access 605 instruction templates of classB, part of the beta field 654 is interpreted as an RL field 657A, whosecontent distinguishes which one of the different augmentation operationtypes are to be performed (e.g., round 657A.1 and vector length (VSIZE)657A.2 are respectively specified for the no memory access, write maskcontrol, partial round control type operation 612 instruction templateand the no memory access, write mask control, VSIZE type operation 617instruction template), while the rest of the beta field 654distinguishes which of the operations of the specified type is to beperformed. In the no memory access 605 instruction templates, the scalefield 660, the displacement field 662A, and the displacement scale filed662B are not present.

In the no memory access, write mask control, partial round control typeoperation 610 instruction template, the rest of the beta field 654 isinterpreted as a round operation field 659A and exception eventreporting is disabled (a given instruction does not report any kind offloating-point exception flag and does not raise any floating-pointexception handler).

Round operation control field 659A—just as round operation control field658, its content distinguishes which one of a group of roundingoperations to perform (e.g., Round-up, Round-down, Round-towards-zeroand Round-to-nearest). Thus, the round operation control field 659Aallows for the changing of the rounding mode on a per instruction basis.In some embodiments where a processor includes a control register forspecifying rounding modes, the round operation control field's 650content overrides that register value.

In the no memory access, write mask control, VSIZE type operation 617instruction template, the rest of the beta field 654 is interpreted as avector length field 659B, whose content distinguishes which one of anumber of data vector lengths is to be performed on (e.g., 128, 256, or512 byte).

In the case of a memory access 620 instruction template of class B, partof the beta field 654 is interpreted as a broadcast field 657B, whosecontent distinguishes whether or not the broadcast type datamanipulation operation is to be performed, while the rest of the betafield 654 is interpreted the vector length field 659B. The memory access620 instruction templates include the scale field 660, and optionallythe displacement field 662A or the displacement scale field 662B.

With regard to the generic vector friendly instruction format 600, afull opcode field 674 is shown including the format field 640, the baseoperation field 642, and the data element width field 664. While oneembodiment is shown where the full opcode field 674 includes all ofthese fields, the full opcode field 674 includes less than all of thesefields in embodiments that do not support all of them. The full opcodefield 674 provides the operation code (opcode).

The augmentation operation field 650, the data element width field 664,and the write mask field 670 allow these features to be specified on aper instruction basis in the generic vector friendly instruction format.

The combination of write mask field and data element width field createtyped instructions in that they allow the mask to be applied based ondifferent data element widths.

The various instruction templates found within class A and class B arebeneficial in different situations. In some embodiments of theinvention, different processors or different cores within a processormay support only class A, only class B, or both classes. For instance, ahigh performance general purpose out-of-order core intended forgeneral-purpose computing may support only class B, a core intendedprimarily for graphics and/or scientific (throughput) computing maysupport only class A, and a core intended for both may support both (ofcourse, a core that has some mix of templates and instructions from bothclasses but not all templates and instructions from both classes iswithin the purview of the invention). Also, a single processor mayinclude multiple cores, all of which support the same class or in whichdifferent cores support different class. For instance, in a processorwith separate graphics and general purpose cores, one of the graphicscores intended primarily for graphics and/or scientific computing maysupport only class A, while one or more of the general purpose cores maybe high performance general purpose cores with out of order executionand register renaming intended for general-purpose computing thatsupport only class B. Another processor that does not have a separategraphics core, may include one more general purpose in-order orout-of-order cores that support both class A and class B. Of course,features from one class may also be implement in the other class indifferent embodiments of the invention. Programs written in a high levellanguage would be put (e.g., just in time compiled or staticallycompiled) into an variety of different executable forms, including: 1) aform having only instructions of the class(es) supported by the targetprocessor for execution; or 2) a form having alternative routineswritten using different combinations of the instructions of all classesand having control flow code that selects the routines to execute basedon the instructions supported by the processor which is currentlyexecuting the code.

Exemplary Specific Vector Friendly Instruction Format

FIG. 7A is a block diagram illustrating an exemplary specific vectorfriendly instruction format according to some embodiments of theinvention. FIG. 7A shows a specific vector friendly instruction format700 that is specific in the sense that it specifies the location, size,interpretation, and order of the fields, as well as values for some ofthose fields. The specific vector friendly instruction format 700 may beused to extend the x86 instruction set, and thus some of the fields aresimilar or the same as those used in the existing x86 instruction setand extension thereof (e.g., AVX). This format remains consistent withthe prefix encoding field, real opcode byte field, MOD R/M field, SIBfield, displacement field, and immediate fields of the existing x86instruction set with extensions. The fields from FIG. 6 into which thefields from FIG. 7A map are illustrated.

It should be understood that, although embodiments of the invention aredescribed with reference to the specific vector friendly instructionformat 700 in the context of the generic vector friendly instructionformat 600 for illustrative purposes, the invention is not limited tothe specific vector friendly instruction format 700 except whereclaimed. For example, the generic vector friendly instruction format 600contemplates a variety of possible sizes for the various fields, whilethe specific vector friendly instruction format 700 is shown as havingfields of specific sizes. By way of specific example, while the dataelement width field 664 is illustrated as a one bit field in thespecific vector friendly instruction format 700, the invention is not solimited (that is, the generic vector friendly instruction format 600contemplates other sizes of the data element width field 664).

The generic vector friendly instruction format 600 includes thefollowing fields listed below in the order illustrated in FIG. 7A.

EVEX Prefix (Bytes 0-3) 702—is encoded in a four-byte form.

Format Field 640 (EVEX Byte 0, bits [7:0])—the first byte (EVEX Byte 0)is the format field 640 and it contains 0×62 (the unique value used fordistinguishing the vector friendly instruction format in someembodiments).

The second-fourth bytes (EVEX Bytes 1-3) include a number of bit fieldsproviding specific capability.

REX field 705 (EVEX Byte 1, bits [7-5])—consists of a EVEX.R bit field(EVEX Byte 1, bit [7]-R), EVEX.X bit field (EVEX byte 1, bit [6]-X), and657BEX byte 1, bit[5]-B). The EVEX.R, EVEX.X, and EVEX.B bit fieldsprovide the same functionality as the corresponding VEX bit fields, andare encoded using 1s complement form, i.e. ZMM0 is encoded as 1111B,ZMM15 is encoded as 0000B. Other fields of the instructions encode thelower three bits of the register indexes as is known in the art (rrr,xxx, and 3), so that Rrrr, Xxxx, and 3b may be formed by adding EVEX.R,EVEX.X, and EVEX.B.

REX′ 710A—this is the first part of the REX′ field 710 and is theEVEX.R′ bit field (EVEX Byte 1, bit [4]-R′) that is used to encodeeither the upper 16 or lower 16 of the extended 32 register set. In someembodiments, this bit, along with others as indicated below, is storedin bit inverted format to distinguish (in the well-known x86 32-bitmode) from the BOUND instruction, whose real opcode byte is 62, but doesnot accept in the MOD R/M field (described below) the value of 11 in theMOD field; alternative embodiments of the invention do not store thisand the other indicated bits below in the inverted format. A value of 1is used to encode the lower 16 registers. In other words, R′Rrrr isformed by combining EVEX.R′, EVEX.R, and the other RRR from otherfields.

Opcode map field 715 (EVEX byte 1, bits [3:0]-mmmm)—its content encodesan implied leading opcode byte (0F, 0F 38, or 0F 3).

Data element width field 664 (EVEX byte 2, bit [7]-W)—is represented bythe notation EVEX.W. EVEX.W is used to define the granularity (size) ofthe datatype (either 32-bit data elements or 64-bit data elements).

EVEX.vvvv 720 (EVEX Byte 2, bits [6:3]-vvvv)—the role of EVEX.vvvv mayinclude the following: 1) EVEX.vvvv encodes the first source registeroperand, specified in inverted (1s complement) form and is valid forinstructions with 2 or more source operands; 2) EVEX.vvvv encodes thedestination register operand, specified in 1s complement form forcertain vector shifts; or 3) EVEX.vvvv does not encode any operand, thefield is reserved and should contain 1111b. Thus, EVEX.vvvv field 720encodes the 4 low-order bits of the first source register specifierstored in inverted (1s complement) form. Depending on the instruction,an extra different EVEX bit field is used to extend the specifier sizeto 32 registers.

EVEX.U668 Class field (EVEX byte 2, bit [2]-U)—If EVEX.U=0, it indicatesclass A or EVEX.U0; if EVEX.U=1, it indicates class B or EVEX.U1.

Prefix encoding field 725 (EVEX byte 2, bits [1:0]-pp)—providesadditional bits for the base operation field. In addition to providingsupport for the legacy SSE instructions in the EVEX prefix format, thisalso has the benefit of compacting the SIMD prefix (rather thanrequiring a byte to express the SIMD prefix, the EVEX prefix requiresonly 2 bits). In one embodiment, to support legacy SSE instructions thatuse a SIMD prefix (66H, F2H, F3H) in both the legacy format and in theEVEX prefix format, these legacy SIMD prefixes are encoded into the SIMDprefix encoding field; and at runtime are expanded into the legacy SIMDprefix prior to being provided to the decoder's PLA (so the PLA canexecute both the legacy and EVEX format of these legacy instructionswithout modification). Although newer instructions could use the EVEXprefix encoding field's content directly as an opcode extension, certainembodiments expand in a similar fashion for consistency but allow fordifferent meanings to be specified by these legacy SIMD prefixes. Analternative embodiment may redesign the PLA to support the 2 bit SIMDprefix encodings, and thus not require the expansion.

Alpha field 652 (EVEX byte 3, bit [7]-EH; also known as EVEX.EH,EVEX.rs, EVEX.RL, EVEX.write mask control, and EVEX.N; also illustratedwith α)—as previously described, this field is context specific.

Beta field 654 (EVEX byte 3, bits [6:4]-SSS, also known as EVEX.s₂₋₀,EVEX.r₂₋₀, EVEX.rr1, EVEX.LL0, EVEX.LLB; also illustrated with βββ)—aspreviously described, this field is context specific.

REX′ 710B—this is the remainder of the REX′ field 710 and is the EVEX.V′bit field (EVEX Byte 3, bit [3]-V′) that may be used to encode eitherthe upper 16 or lower 16 of the extended 32 register set. This bit isstored in bit inverted format. A value of 1 is used to encode the lower16 registers. In other words, V′VVVV is formed by combining EVEX.V′,EVEX.vvvv.

Write mask field 670 (EVEX byte 3, bits [2:0]-kkk)—its content specifiesthe index of a register in the write mask registers as previouslydescribed. In some embodiments, the specific value EVEX.kkk=000 has aspecial behavior implying no write mask is used for the particularinstruction (this may be implemented in a variety of ways including theuse of a write mask hardwired to all ones or hardware that bypasses themasking hardware).

Real Opcode Field 730 (Byte 4) is also known as the opcode byte. Part ofthe opcode is specified in this field.

MOD R/M Field 740 (Byte 5) includes MOD field 742, Reg field 744, andR/M field 746. As previously described, the MOD field's 742 contentdistinguishes between memory access and non-memory access operations.The role of Reg field 744 can be summarized to two situations: encodingeither the destination register operand or a source register operand orbe treated as an opcode extension and not used to encode any instructionoperand. The role of R/M field 746 may include the following: encodingthe instruction operand that references a memory address or encodingeither the destination register operand or a source register operand.

Scale, Index, Base (SIB) Byte (Byte 6)—As previously described, thescale field's 650 content is used for memory address generation. SIB.xxx754 and SIB.bbb 756—the contents of these fields have been previouslyreferred to with regard to the register indexes Xxxx and 3b.

Displacement field 662A (Bytes 7-10)—when MOD field 742 contains 10,bytes 7-10 are the displacement field 662A, and it works the same as thelegacy 32-bit displacement (disp32) and works at byte granularity.

Displacement factor field 662B (Byte 7)—when MOD field 742 contains 01,byte 7 is the displacement factor field 662B. The location of this fieldis that same as that of the legacy x86 instruction set 8-bitdisplacement (disp8), which works at byte granularity. Since disp8 issign extended, it can only address between −128 and 127 bytes offsets;in terms of 64 byte cache lines, disp8 uses 8 bits that can be set toonly four really useful values −128, −64, 0, and 64; since a greaterrange is often needed, disp32 is used; however, disp32 requires 4 bytes.In contrast to disp8 and disp32, the displacement factor field 662B is areinterpretation of disp8; when using displacement factor field 662B,the actual displacement is determined by the content of the displacementfactor field multiplied by the size of the memory operand access (N).This type of displacement is referred to as disp8*N. This reduces theaverage instruction length (a single byte of used for the displacementbut with a much greater range). Such compressed displacement is based onthe assumption that the effective displacement is multiple of thegranularity of the memory access, and hence, the redundant low-orderbits of the address offset do not need to be encoded. In other words,the displacement factor field 662B substitutes the legacy x86instruction set 8-bit displacement. Thus, the displacement factor field662B is encoded the same way as an x86 instruction set 8-bitdisplacement (so no changes in the ModRM/SIB encoding rules) with theonly exception that disp8 is overloaded to disp8*N. In other words,there are no changes in the encoding rules or encoding lengths but onlyin the interpretation of the displacement value by hardware (which needsto scale the displacement by the size of the memory operand to obtain abyte-wise address offset). Immediate field 672 operates as previouslydescribed.

Full Opcode Field

FIG. 7B is a block diagram illustrating the fields of the specificvector friendly instruction format 700 that make up the full opcodefield 674 according to some embodiments. Specifically, the full opcodefield 674 includes the format field 640, the base operation field 642,and the data element width (W) field 664. The base operation field 642includes the prefix encoding field 725, the opcode map field 715, andthe real opcode field 730.

Register Index Field

FIG. 7C is a block diagram illustrating the fields of the specificvector friendly instruction format 700 that make up the register indexfield 644 according to some embodiments. Specifically, the registerindex field 644 includes the REX field 705, the REX′ field 710, theMODR/M.reg field 744, the MODR/M.r/m field 746, the VVVV field 720, xxxfield 754, and the bbb field 756.

Augmentation Operation Field

FIG. 7D is a block diagram illustrating the fields of the specificvector friendly instruction format 700 that make up the augmentationoperation field 650 according to some embodiments. When the class (U)field 668 contains 0, it signifies EVEX.U0 (class A 668A); when itcontains 1, it signifies EVEX.U1 (class B 668B). When U=0 and the MODfield 742 contains 11 (signifying a no memory access operation), thealpha field 652 (EVEX byte 3, bit [7]-EH) is interpreted as the rs field652A. When the rs field 652A contains a 1 (round 652A.1), the beta field654 (EVEX byte 3, bits [6:4]-SSS) is interpreted as the round controlfield 654A. The round control field 654A includes a one bit SAE field656 and a two bit round operation field 658. When the rs field 652Acontains a 0 (data transform 652A.2), the beta field 654 (EVEX byte 3,bits [6:4]- SSS) is interpreted as a three bit data transform field654B. When U=0 and the MOD field 742 contains 00, 01, or 10 (signifyinga memory access operation), the alpha field 652 (EVEX byte 3, bit[7]-EH) is interpreted as the eviction hint (EH) field 652B and the betafield 654 (EVEX byte 3, bits [6:4]-SSS) is interpreted as a three bitdata manipulation field 654C.

When U=1, the alpha field 652 (EVEX byte 3, bit [7]-EH) is interpretedas the write mask control (Z) field 652C. When U=1 and the MOD field 742contains 11 (signifying a no memory access operation), part of the betafield 654 (EVEX byte 3, bit [4]-S₀) is interpreted as the RL field 657A;when it contains a 1 (round 657A.1) the rest of the beta field 654 (EVEXbyte 3, bit [6-5]-S₂₋₁) is interpreted as the round operation field659A, while when the RL field 657A contains a 0 (VSIZE 657.A2) the restof the beta field 654 (EVEX byte 3, bit [6-5]-S₂₋₁) is interpreted asthe vector length field 659B (EVEX byte 3, bit [6-5]-L₁₋₀). When U=1 andthe MOD field 742 contains 00, 01, or 10 (signifying a memory accessoperation), the beta field 654 (EVEX byte 3, bits [6:4]-SSS) isinterpreted as the vector length field 659B (EVEX byte 3, bit[6-5]-L₁₋₀) and the broadcast field 657B (EVEX byte 3, bit [4]-B).

Exemplary Register Architecture

FIG. 8 is a block diagram of a register architecture 800 according tosome embodiments. In the embodiment illustrated, there are 32 vectorregisters 810 that are 512 bits wide; these registers are referenced aszmm0 through zmm31. The lower order 256 bits of the lower 16 zmmregisters are overlaid on registers ymm0-16. The lower order 128 bits ofthe lower 16 zmm registers (the lower order 128 bits of the ymmregisters) are overlaid on registers xmm0-15. The specific vectorfriendly instruction format 700 operates on these overlaid register fileas illustrated in the below tables.

Adjustable Vector Length Class Operations Registers Instruction A (FIG.610, 615, zmm registers (the Templates that 6A; U = 0) 625, 630 vectorlength is do not include 64 byte) the vector length B (FIG. 612 zmmregisters (the field 659B 6B; U = 1) vector length is 64 byte)Instruction B (FIG. 617, 627 zmm, ymm, or xmm templates 6B; U = 1)registers (the that do include vector length is 64 the vector lengthbyte, 32 byte, or 16 field 659B byte) depending on the vector lengthfield 659B

In other words, the vector length field 659B selects between a maximumlength and one or more other shorter lengths, where each such shorterlength is half the length of the preceding length; and instructionstemplates without the vector length field 659B operate on the maximumvector length. Further, in one embodiment, the class B instructiontemplates of the specific vector friendly instruction format 700 operateon packed or scalar single/double-precision floating-point data andpacked or scalar integer data. Scalar operations are operationsperformed on the lowest order data element position in an zmm/ymm/xmmregister; the higher order data element positions are either left thesame as they were prior to the instruction or zeroed depending on theembodiment.

Write mask registers 815—in the embodiment illustrated, there are 8write mask registers (k0 through k7), each 64 bits in size. In analternate embodiment, the write mask registers 815 are 16 bits in size.As previously described, in some embodiments, the vector mask registerk0 cannot be used as a write mask; when the encoding that would normallyindicate k0 is used for a write mask, it selects a hardwired write maskof 0xffff, effectively disabling write masking for that instruction.

General-purpose registers 825—in the embodiment illustrated, there aresixteen 64-bit general-purpose registers that are used along with theexisting x86 addressing modes to address memory operands. Theseregisters are referenced by the names RAX, RBX, RCX, RDX, RBP, RSI, RDI,RSP, and R8 through R15.

Scalar floating-point stack register file (x87 stack) 845, on which isaliased the MMX packed integer flat register file 850—in the embodimentillustrated, the x87 stack is an eight-element stack used to performscalar floating-point operations on 32/64/80-bit floating-point datausing the x87 instruction set extension; while the MMX registers areused to perform operations on 64-bit packed integer data, as well as tohold operands for some operations performed between the MMX and XMMregisters.

Alternative embodiments may use wider or narrower registers.Additionally, alternative embodiments may use more, less, or differentregister files and registers.

Exemplary Core Architectures, Processors, and Computer Architectures

Processor cores may be implemented in different ways, for differentpurposes, and in different processors. For instance, implementations ofsuch cores may include: 1) a general purpose in-order core intended forgeneral-purpose computing; 2) a high performance general purposeout-of-order core intended for general-purpose computing; 3) a specialpurpose core intended primarily for graphics and/or scientific(throughput) computing. Implementations of different processors mayinclude: 1) a CPU including one or more general purpose in-order coresintended for general-purpose computing and/or one or more generalpurpose out-of-order cores intended for general-purpose computing; and2) a coprocessor including one or more special purpose cores intendedprimarily for graphics and/or scientific (throughput). Such differentprocessors lead to different computer system architectures, which mayinclude: 1) the coprocessor on a separate chip from the CPU; 2) thecoprocessor on a separate die in the same package as a CPU; 3) thecoprocessor on the same die as a CPU (in which case, such a coprocessoris sometimes referred to as special purpose logic, such as integratedgraphics and/or scientific (throughput) logic, or as special purposecores); and 4) a system on a chip that may include on the same die thedescribed CPU (sometimes referred to as the application core(s) orapplication processor(s)), the above described coprocessor, andadditional functionality. Exemplary core architectures are describednext, followed by descriptions of exemplary processors and computerarchitectures.

Exemplary Core Architectures In-Order and Out-of-Order Core BlockDiagram

FIG. 9A is a block diagram illustrating both an exemplary in-orderpipeline and an exemplary register renaming, out-of-orderissue/execution pipeline according to some embodiments of the invention.FIG. 9B is a block diagram illustrating both an exemplary embodiment ofan in-order architecture core and an exemplary register renaming,out-of-order issue/execution architecture core to be included in aprocessor according to some embodiments of the invention. The solidlined boxes in FIGS. 9A-B illustrate the in-order pipeline and in-ordercore, while the optional addition of the dashed lined boxes illustratesthe register renaming, out-of-order issue/execution pipeline and core.Given that the in-order aspect is a subset of the out-of-order aspect,the out-of-order aspect will be described.

In FIG. 9A, a processor pipeline 900 includes a fetch stage 902, alength decode stage 904, a decode stage 906, an allocation stage 908, arenaming stage 910, a scheduling (also known as a dispatch or issue)stage 912, a register read/memory read stage 914, an execute stage 916,a write back/memory write stage 918, an exception handling stage 922,and a commit stage 924.

FIG. 9B shows processor core 990 including a front end unit 930 coupledto an execution engine unit 950, and both are coupled to a memory unit970. The core 990 may be a reduced instruction set computing (RISC)core, a complex instruction set computing (CISC) core, a very longinstruction word (VLIW) core, or a hybrid or alternative core type. Asyet another option, the core 990 may be a special-purpose core, such as,for example, a network or communication core, compression engine,coprocessor core, general purpose computing graphics processing unit(GPGPU) core, graphics core, or the like.

The front end unit 930 includes a branch prediction unit 932 coupled toan instruction cache unit 934, which is coupled to an instructiontranslation lookaside buffer (TLB) 936, which is coupled to aninstruction fetch unit 938, which is coupled to a decode unit 940. Thedecode unit 940 (or decoder) may decode instructions, and generate as anoutput one or more micro-operations, micro-code entry points,microinstructions, other instructions, or other control signals, whichare decoded from, or which otherwise reflect, or are derived from, theoriginal instructions. The decode unit 940 may be implemented usingvarious different mechanisms. Examples of suitable mechanisms include,but are not limited to, look-up tables, hardware implementations,programmable logic arrays (PLAs), microcode read only memories (ROMs),etc. In one embodiment, the core 990 includes a microcode ROM or othermedium that stores microcode for certain macroinstructions (e.g., indecode unit 940 or otherwise within the front end unit 930). The decodeunit 940 is coupled to a rename/allocator unit 952 in the executionengine unit 950.

The execution engine unit 950 includes the rename/allocator unit 952coupled to a retirement unit 954 and a set of one or more schedulerunit(s) 956. The scheduler unit(s) 956 represents any number ofdifferent schedulers, including reservations stations, centralinstruction window, etc. The scheduler unit(s) 956 is coupled to thephysical register file(s) unit(s) 958. Each of the physical registerfile(s) units 958 represents one or more physical register files,different ones of which store one or more different data types, such asscalar integer, scalar floating-point, packed integer, packedfloating-point, vector integer, vector floating-point, status (e.g., aninstruction pointer that is the address of the next instruction to beexecuted), etc. In one embodiment, the physical register file(s) unit958 comprises a vector registers unit, a write mask registers unit, anda scalar registers unit. These register units may provide architecturalvector registers, vector mask registers, and general purpose registers.The physical register file(s) unit(s) 958 is overlapped by theretirement unit 954 to illustrate various ways in which registerrenaming and out-of-order execution may be implemented (e.g., using areorder buffer(s) and a retirement register file(s); using a futurefile(s), a history buffer(s), and a retirement register file(s); using aregister maps and a pool of registers; etc.). The retirement unit 954and the physical register file(s) unit(s) 958 are coupled to theexecution cluster(s) 960. The execution cluster(s) 960 includes a set ofone or more execution units 962 and a set of one or more memory accessunits 964. The execution units 962 may perform various operations (e.g.,shifts, addition, subtraction, multiplication) and on various types ofdata (e.g., scalar floating-point, packed integer, packedfloating-point, vector integer, vector floating-point). While someembodiments may include a number of execution units dedicated tospecific functions or sets of functions, other embodiments may includeonly one execution unit or multiple execution units that all perform allfunctions. The scheduler unit(s) 956, physical register file(s) unit(s)958, and execution cluster(s) 960 are shown as being possibly pluralbecause certain embodiments create separate pipelines for certain typesof data/operations (e.g., a scalar integer pipeline, a scalarfloating-point/packed integer/packed floating-point/vectorinteger/vector floating-point pipeline, and/or a memory access pipelinethat each have their own scheduler unit, physical register file(s) unit,and/or execution cluster—and in the case of a separate memory accesspipeline, certain embodiments are implemented in which only theexecution cluster of this pipeline has the memory access unit(s) 964).It should also be understood that where separate pipelines are used, oneor more of these pipelines may be out-of-order issue/execution and therest in-order.

The set of memory access units 964 is coupled to the memory unit 970,which includes a data TLB unit 972 coupled to a data cache unit 974coupled to a level 2 (L2) cache unit 976. In one exemplary embodiment,the memory access units 964 may include a load unit, a store addressunit, and a store data unit, each of which is coupled to the data TLBunit 972 in the memory unit 970. The instruction cache unit 934 isfurther coupled to a level 2 (L2) cache unit 976 in the memory unit 970.The L2 cache unit 976 is coupled to one or more other levels of cacheand eventually to a main memory.

By way of example, the exemplary register renaming, out-of-orderissue/execution core architecture may implement the pipeline 900 asfollows: 1) the instruction fetch 938 performs the fetch and lengthdecoding stages 902 and 904; 2) the decode unit 940 performs the decodestage 906; 3) the rename/allocator unit 952 performs the allocationstage 908 and renaming stage 910; 4) the scheduler unit(s) 956 performsthe schedule stage 912; 5) the physical register file(s) unit(s) 958 andthe memory unit 970 perform the register read/memory read stage 914; theexecution cluster 960 perform the execute stage 916; 6) the memory unit970 and the physical register file(s) unit(s) 958 perform the writeback/memory write stage 918; 7) various units may be involved in theexception handling stage 922; and 8) the retirement unit 954 and thephysical register file(s) unit(s) 958 perform the commit stage 924.

The core 990 may support one or more instructions sets (e.g., the x86instruction set (with some extensions that have been added with newerversions); the MIPS instruction set of MIPS Technologies of Sunnyvale,Calif.; the ARM instruction set (with optional additional extensionssuch as NEON) of ARM Holdings of Sunnyvale, Calif.), including theinstruction(s) described herein. In one embodiment, the core 990includes logic to support a packed data instruction set extension (e.g.,AVX1, AVX2), thereby allowing the operations used by many multimediaapplications to be performed using packed data.

It should be understood that the core may support multithreading(executing two or more parallel sets of operations or threads), and maydo so in a variety of ways including time sliced multithreading,simultaneous multithreading (where a single physical core provides alogical core for each of the threads that physical core issimultaneously multithreading), or a combination thereof (e.g., timesliced fetching and decoding and simultaneous multithreading thereaftersuch as in the Intel® Hyperthreading technology).

While register renaming is described in the context of out-of-orderexecution, it should be understood that register renaming may be used inan in-order architecture. While the illustrated embodiment of theprocessor also includes separate instruction and data cache units934/974 and a shared L2 cache unit 976, alternative embodiments may havea single internal cache for both instructions and data, such as, forexample, a Level 1 (L1) internal cache, or multiple levels of internalcache. In some embodiments, the system may include a combination of aninternal cache and an external cache that is external to the core and/orthe processor. Alternatively, all of the cache may be external to thecore and/or the processor.

Specific Exemplary In-Order Core Architecture

FIGS. 10A-B illustrate a block diagram of a more specific exemplaryin-order core architecture, which core would be one of several logicblocks (including other cores of the same type and/or different types)in a chip. The logic blocks communicate through a high-bandwidthinterconnect network (e.g., a ring network) with some fixed functionlogic, memory I/O interfaces, and other necessary I/O logic, dependingon the application.

FIG. 10A is a block diagram of a single processor core, along with itsconnection to the on-die interconnect network 1002 and with its localsubset of the Level 2 (L2) cache 1004, according to some embodiments ofthe invention. In one embodiment, an instruction decoder 1000 supportsthe x86 instruction set with a packed data instruction set extension. AnL1 cache 1006 allows low-latency accesses to cache memory into thescalar and vector units. While in one embodiment (to simplify thedesign), a scalar unit 1008 and a vector unit 1010 use separate registersets (respectively, scalar registers 1012 and vector registers 1014) anddata transferred between them is written to memory and then read back infrom a level 1 (L1) cache 1006, alternative embodiments of the inventionmay use a different approach (e.g., use a single register set or includea communication path that allow data to be transferred between the tworegister files without being written and read back).

The local subset of the L2 cache 1004 is part of a global L2 cache thatis divided into separate local subsets, one per processor core. Eachprocessor core has a direct access path to its own local subset of theL2 cache 1004. Data read by a processor core is stored in its L2 cachesubset 1004 and can be accessed quickly, in parallel with otherprocessor cores accessing their own local L2 cache subsets. Data writtenby a processor core is stored in its own L2 cache subset 1004 and isflushed from other subsets, if necessary. The ring network ensurescoherency for shared data. The ring network is bi-directional to allowagents such as processor cores, L2 caches and other logic blocks tocommunicate with each other within the chip. Each ring data-path is1012-bits wide per direction.

FIG. 10B is an expanded view of part of the processor core in FIG. 10Aaccording to some embodiments of the invention. FIG. 10B includes an L1data cache 1006A part of the L1 cache 1004, as well as more detailregarding the vector unit 1010 and the vector registers 1014.Specifically, the vector unit 1010 is a 16-wide vector processing unit(VPU) (see the 16-wide ALU 1028), which executes one or more of integer,single-precision float, and double-precision float instructions. The VPUsupports swizzling the register inputs with swizzle unit 1020, numericconversion with numeric convert units 1022A-B, and replication withreplication unit 1024 on the memory input. Write mask registers 1026allow predicating resulting vector writes.

FIG. 11 is a block diagram of a processor 1100 that may have more thanone core, may have an integrated memory controller, and may haveintegrated graphics according to some embodiments of the invention. Thesolid lined boxes in FIG. 11 illustrate a processor 1100 with a singlecore 1102A, a system agent 1110, a set of one or more bus controllerunits 1116, while the optional addition of the dashed lined boxesillustrates an alternative processor 1100 with multiple cores 1102A-N, aset of one or more integrated memory controller unit(s) 1114 in thesystem agent unit 1110, and special purpose logic 1108.

Thus, different implementations of the processor 1100 may include: 1) aCPU with the special purpose logic 1108 being integrated graphics and/orscientific (throughput) logic (which may include one or more cores), andthe cores 1102A-N being one or more general purpose cores (e.g., generalpurpose in-order cores, general purpose out-of-order cores, acombination of the two); 2) a coprocessor with the cores 1102A-N being alarge number of special purpose cores intended primarily for graphicsand/or scientific (throughput); and 3) a coprocessor with the cores1102A-N being a large number of general purpose in-order cores. Thus,the processor 1100 may be a general-purpose processor, coprocessor orspecial-purpose processor, such as, for example, a network orcommunication processor, compression engine, graphics processor, GPGPU(general purpose graphics processing unit), a high-throughput manyintegrated core (MIC) coprocessor (including 30 or more cores), embeddedprocessor, or the like. The processor may be implemented on one or morechips. The processor 1100 may be a part of and/or may be implemented onone or more substrates using any of a number of process technologies,such as, for example, BiCMOS, CMOS, or NMOS.

The memory hierarchy includes one or more levels of cache within thecores, a set or one or more shared cache units 1106, and external memory(not shown) coupled to the set of integrated memory controller units1114. The set of shared cache units 1106 may include one or moremid-level caches, such as level 2 (L2), level 3 (L3), level 4 (L4), orother levels of cache, a last level cache (LLC), and/or combinationsthereof. While in one embodiment a ring based interconnect unit 1112interconnects the integrated graphics logic 1108 (integrated graphicslogic 1108 is an example of and is also referred to herein as specialpurpose logic), the set of shared cache units 1106, and the system agentunit 1110/integrated memory controller unit(s) 1114, alternativeembodiments may use any number of well-known techniques forinterconnecting such units. In one embodiment, coherency is maintainedbetween one or more cache units 1106 and cores 1102-A-N.

In some embodiments, one or more of the cores 1102A-N are capable ofmulti-threading. The system agent 1110 includes those componentscoordinating and operating cores 1102A-N. The system agent unit 1110 mayinclude for example a power control unit (PCU) and a display unit. ThePCU may be or include logic and components needed for regulating thepower state of the cores 1102A-N and the integrated graphics logic 1108.The display unit is for driving one or more externally connecteddisplays.

The cores 1102A-N may be homogenous or heterogeneous in terms ofarchitecture instruction set; that is, two or more of the cores 1102A-Nmay be capable of execution the same instruction set, while others maybe capable of executing only a subset of that instruction set or adifferent instruction set.

Exemplary Computer Architectures

FIGS. 12-15 are block diagrams of exemplary computer architectures.Other system designs and configurations known in the arts for laptops,desktops, handheld PCs, personal digital assistants, engineeringworkstations, servers, network devices, network hubs, switches, embeddedprocessors, digital signal processors (DSPs), graphics devices, videogame devices, set-top boxes, micro controllers, cell phones, portablemedia players, hand held devices, and various other electronic devices,are also suitable. In general, a huge variety of systems or electronicdevices capable of incorporating a processor and/or other executionlogic as disclosed herein are generally suitable.

Referring now to FIG. 12, shown is a block diagram of a system 1200 inaccordance with one embodiment of the present invention. The system 1200may include one or more processors 1210, 1215, which are coupled to acontroller hub 1220. In one embodiment the controller hub 1220 includesa graphics memory controller hub (GMCH) 1290 and an Input/Output Hub(IOH) 1250 (which may be on separate chips); the GMCH 1290 includesmemory and graphics controllers to which are coupled memory 1240 and acoprocessor 1245; the IOH 1250 couples input/output (I/O) devices 1260to the GMCH 1290. Alternatively, one or both of the memory and graphicscontrollers are integrated within the processor (as described herein),the memory 1240 and the coprocessor 1245 are coupled directly to theprocessor 1210, and the controller hub 1220 in a single chip with theIOH 1250.

The optional nature of additional processors 1215 is denoted in FIG. 12with broken lines. Each processor 1210, 1215 may include one or more ofthe processing cores described herein and may be some version of theprocessor 1100.

The memory 1240 may be, for example, dynamic random access memory(DRAM), phase change memory (PCM), or a combination of the two. For atleast one embodiment, the controller hub 1220 communicates with theprocessor(s) 1210, 1215 via a multi-drop bus, such as a frontside bus(FSB), point-to-point interface such as QuickPath Interconnect (QPI), orsimilar connection 1295.

In one embodiment, the coprocessor 1245 is a special-purpose processor,such as, for example, a high-throughput MIC processor, a network orcommunication processor, compression engine, graphics processor, GPGPU,embedded processor, or the like. In one embodiment, controller hub 1220may include an integrated graphics accelerator.

There can be a variety of differences between the physical resources1210, 1215 in terms of a spectrum of metrics of merit includingarchitectural, microarchitectural, thermal, power consumptioncharacteristics, and the like.

In one embodiment, the processor 1210 executes instructions that controldata processing operations of a general type. Embedded within theinstructions may be coprocessor instructions. The processor 1210recognizes these coprocessor instructions as being of a type that shouldbe executed by the attached coprocessor 1245. Accordingly, the processor1210 issues these coprocessor instructions (or control signalsrepresenting coprocessor instructions) on a coprocessor bus or otherinterconnect, to coprocessor 1245. Coprocessor(s) 1245 accept andexecute the received coprocessor instructions.

Referring now to FIG. 13, shown is a block diagram of a first morespecific exemplary system 1300 in accordance with an embodiment of thepresent invention. As shown in FIG. 13, multiprocessor system 1300 is apoint-to-point interconnect system, and includes a first processor 1370and a second processor 1380 coupled via a point-to-point interconnect1350. Each of processors 1370 and 1380 may be some version of theprocessor 1100. In some embodiments, processors 1370 and 1380 arerespectively processors 1210 and 1215, while coprocessor 1338 iscoprocessor 1245. In another embodiment, processors 1370 and 1380 arerespectively processor 1210 coprocessor 1245.

Processors 1370 and 1380 are shown including integrated memorycontroller (IMC) units 1372 and 1382, respectively. Processor 1370 alsoincludes as part of its bus controller units point-to-point (P-P)interfaces 1376 and 1378; similarly, second processor 1380 includes P-Pinterfaces 1386 and 1388. Processors 1370, 1380 may exchange informationvia a point-to-point (P-P) interface 1350 using P-P interface circuits1378, 1388. As shown in FIG. 13, IMCs 1372 and 1382 couple theprocessors to respective memories, namely a memory 1332 and a memory1334, which may be portions of main memory locally attached to therespective processors.

Processors 1370, 1380 may each exchange information with a chipset 1390via individual P-P interfaces 1352, 1354 using point to point interfacecircuits 1376, 1394, 1386, 1398. Chipset 1390 may optionally exchangeinformation with the coprocessor 1338 via a high-performance interface1392. In one embodiment, the coprocessor 1338 is a special-purposeprocessor, such as, for example, a high-throughput MIC processor, anetwork or communication processor, compression engine, graphicsprocessor, GPGPU, embedded processor, or the like.

A shared cache (not shown) may be included in either processor oroutside of both processors yet connected with the processors via P-Pinterconnect, such that either or both processors' local cacheinformation may be stored in the shared cache if a processor is placedinto a low power mode.

Chipset 1390 may be coupled to a first bus 1316 via an interface 1396.In one embodiment, first bus 1316 may be a Peripheral ComponentInterconnect (PCI) bus, or a bus such as a PCI Express bus or anotherthird generation I/O interconnect bus, although the scope of the presentinvention is not so limited.

As shown in FIG. 13, various I/O devices 1314 may be coupled to firstbus 1316, along with a bus bridge 1318 which couples first bus 1316 to asecond bus 1320. In one embodiment, one or more additional processor(s)1315, such as coprocessors, high-throughput MIC processors, GPGPU's,accelerators (such as, e.g., graphics accelerators or digital signalprocessing (DSP) units), field programmable gate arrays, or any otherprocessor, are coupled to first bus 1316. In one embodiment, second bus1320 may be a low pin count (LPC) bus. Various devices may be coupled toa second bus 1320 including, for example, a keyboard and/or mouse 1322,communication devices 1327 and a storage unit 1328 such as a disk driveor other mass storage device which may include instructions/code anddata 1330, in one embodiment. Further, an audio I/O 1324 may be coupledto the second bus 1320. Note that other architectures are possible. Forexample, instead of the point-to-point architecture of FIG. 13, a systemmay implement a multi-drop bus or other such architecture.

Referring now to FIG. 14, shown is a block diagram of a second morespecific exemplary system 1400 in accordance with an embodiment of thepresent invention. Like elements in FIGS. 13 and 14 bear like referencenumerals, and certain aspects of FIG. 13 have been omitted from FIG. 14in order to avoid obscuring other aspects of FIG. 14.

FIG. 14 illustrates that the processors 1370, 1380 may includeintegrated memory and I/O control logic (“CL”) 1472 and 1482,respectively. Thus, the CL 1472, 1482 include integrated memorycontroller units and include I/O control logic. FIG. 14 illustrates thatnot only are the memories 1332, 1334 coupled to the CL 1472, 1482, butalso that I/O devices 1414 are also coupled to the control logic 1472,1482. Legacy I/O devices 1415 are coupled to the chipset 1390.

Referring now to FIG. 15, shown is a block diagram of a SoC 1500 inaccordance with an embodiment of the present invention. Similar elementsin FIG. 11 bear like reference numerals. Also, dashed lined boxes areoptional features on more advanced SoCs. In FIG. 15, an interconnectunit(s) 1502 is coupled to: an application processor 1510 which includesa set of one or more cores 1102A-N, which include cache units 1104A-N,and shared cache unit(s) 1106; a system agent unit 1110; a buscontroller unit(s) 1116; an integrated memory controller unit(s) 1114; aset or one or more coprocessors 1520 which may include integratedgraphics logic, an image processor, an audio processor, and a videoprocessor; an static random access memory (SRAM) unit 1530; a directmemory access (DMA) unit 1532; and a display unit 1540 for coupling toone or more external displays. In one embodiment, the coprocessor(s)1520 include a special-purpose processor, such as, for example, anetwork or communication processor, compression engine, GPGPU, ahigh-throughput MIC processor, embedded processor, or the like.

Embodiments of the mechanisms disclosed herein may be implemented inhardware, software, firmware, or a combination of such implementationapproaches. Embodiments of the invention may be implemented as computerprograms or program code executing on programmable systems comprising atleast one processor, a storage system (including volatile andnon-volatile memory and/or storage elements), at least one input device,and at least one output device.

Program code, such as code 1330 illustrated in FIG. 13, may be appliedto input instructions to perform the functions described herein andgenerate output information. The output information may be applied toone or more output devices, in known fashion. For purposes of thisapplication, a processing system includes any system that has aprocessor, such as, for example; a digital signal processor (DSP), amicrocontroller, an application specific integrated circuit (ASIC), or amicroprocessor.

The program code may be implemented in a high level procedural or objectoriented programming language to communicate with a processing system.The program code may also be implemented in assembly or machinelanguage, if desired. In fact, the mechanisms described herein are notlimited in scope to any particular programming language. In any case,the language may be a compiled or interpreted language.

One or more aspects of at least one embodiment may be implemented byrepresentative instructions stored on a machine-readable medium whichrepresents various logic within the processor, which when read by amachine causes the machine to fabricate logic to perform the techniquesdescribed herein. Such representations, known as “IP cores” may bestored on a tangible, machine readable medium and supplied to variouscustomers or manufacturing facilities to load into the fabricationmachines that actually make the logic or processor.

Such machine-readable storage media may include, without limitation,non-transitory, tangible arrangements of articles manufactured or formedby a machine or device, including storage media such as hard disks, anyother type of disk including floppy disks, optical disks, compact diskread-only memories (CD-ROMs), compact disk rewritable's (CD-RWs), andmagneto-optical disks, semiconductor devices such as read-only memories(ROMs), random access memories (RAMS) such as dynamic random accessmemories (DRAMs), static random access memories (SRAMs), erasableprogrammable read-only memories (EPROMs), flash memories, electricallyerasable programmable read-only memories (EEPROMs), phase change memory(PCM), magnetic or optical cards, or any other type of media suitablefor storing electronic instructions.

Accordingly, embodiments of the invention also include non-transitory,tangible machine-readable media containing instructions or containingdesign data, such as Hardware Description Language (HDL), which definesstructures, circuits, apparatuses, processors and/or system featuresdescribed herein. Such embodiments may also be referred to as programproducts.

Emulation (Including Binary Translation, Code Morphing, Etc.)

In some cases, an instruction converter may be used to convert aninstruction from a source instruction set to a target instruction set.For example, the instruction converter may translate (e.g., using staticbinary translation, dynamic binary translation including dynamiccompilation), morph, emulate, or otherwise convert an instruction to oneor more other instructions to be processed by the core. The instructionconverter may be implemented in software, hardware, firmware, or acombination thereof. The instruction converter may be on processor, offprocessor, or part on and part off processor.

FIG. 16 is a block diagram contrasting the use of a software instructionconverter to convert binary instructions in a source instruction set tobinary instructions in a target instruction set according to someembodiments of the invention. In the illustrated embodiment, theinstruction converter is a software instruction converter, althoughalternatively the instruction converter may be implemented in software,firmware, hardware, or various combinations thereof. FIG. 16 shows aprogram in a high level language 1602 may be compiled using an x86compiler 1604 to generate x86 binary code 1606 that may be nativelyexecuted by a processor with at least one x86 instruction set core 1616.The processor with at least one x86 instruction set core 1616 representsany processor that can perform substantially the same functions as anIntel processor with at least one x86 instruction set core by compatiblyexecuting or otherwise processing (1) a substantial portion of theinstruction set of the Intel x86 instruction set core or (2) object codeversions of applications or other software targeted to run on an Intelprocessor with at least one x86 instruction set core, in order toachieve substantially the same result as an Intel processor with atleast one x86 instruction set core. The x86 compiler 1604 represents acompiler that is operable to generate x86 binary code 1606 (e.g., objectcode) that can, with or without additional linkage processing, beexecuted on the processor with at least one x86 instruction set core1616. Similarly, FIG. 16 shows the program in the high level language1602 may be compiled using an alternative instruction set compiler 1608to generate alternative instruction set binary code 1610 that may benatively executed by a processor without at least one x86 instructionset core 1614 (e.g., a processor with cores that execute the MIPSinstruction set of MIPS Technologies of Sunnyvale, Calif. and/or thatexecute the ARM instruction set of ARM Holdings of Sunnyvale, Calif.).The instruction converter 1612 is used to convert the x86 binary code1606 into code that may be natively executed by the processor without anx86 instruction set core 1614. This converted code is not likely to bethe same as the alternative instruction set binary code 1610 because aninstruction converter capable of this is difficult to make; however, theconverted code will accomplish the general operation and be made up ofinstructions from the alternative instruction set. Thus, the instructionconverter 1612 represents software, firmware, hardware, or a combinationthereof that, through emulation, simulation or any other process, allowsa processor or other electronic device that does not have an x86instruction set processor or core to execute the x86

FURTHER EXAMPLES

Example 1 provides an exemplary processor comprising: fetch circuitry tofetch an instruction having fields to specify an opcode and locations offirst source, second source, and destination vectors, the opcode toindicate execution circuitry is to multiply N pairs of 16-bitfloating-point formatted elements of the specified first and secondsources, and accumulate the resulting products with previous contents ofa corresponding single-precision element of the specified destination;decode circuitry to decode the fetched instruction; and executioncircuitry to respond to the decoded instruction as specified by theopcode.

Example 2 includes the substance of the exemplary processor of Example1, wherein the locations of each of the specified source and destinationvectors are either in registers or in memory.

Example 3 includes the substance of the exemplary processor of Example1, wherein the 16-bit floating-point format comprises a sign bit, an8-bit exponent, and a mantissa comprising 7 explicit bits and an eighthimplicit bit.

Example 4 includes the substance of the exemplary processor of Example1, wherein N is specified by the instruction and has a value in someembodiments equaling any one of 4, 8, and 16 (but the invention does notplace an upper limit on N, which could be 32, 64, or larger, andassociated with source vectors having 1024, 2048, or more bits.).

Example 5 includes the substance of the exemplary processor of Example1, wherein the execution circuitry is to perform the multiplicationswith infinite precision without saturation and to saturate the resultsof the accumulation to plus or minus infinity in case of an overflow andto zero in case of any underflow.

Example 6 includes the substance of the exemplary processor of Example1, wherein the 16-bit floating-point format is either bfloat16 orbinary16.

Example 7 includes the substance of the exemplary processor of Example1, wherein the execution circuitry is to generate all N elements of thespecified destination in parallel.

Example 8 provides an exemplary method comprising: fetching, using fetchcircuitry, an instruction having fields to specify an opcode andlocations of first source, second source, and destination vectors, theopcode to indicate execution circuitry is to multiply N pairs of 16-bitfloating-point formatted elements of the specified first and secondsources, and accumulate the resulting products with previous contents ofa corresponding single-precision element of the specified destination;decoding, using decode circuitry, the fetched instruction; andresponding to the decoded instruction as specified by the opcode withexecution circuitry.

Example 9 includes the substance of the exemplary method of Example 8,wherein the locations of each of the specified source and destinationvectors are either in registers or in memory.

Example 10 includes the substance of the exemplary method of Example 8,wherein the 16-bit floating-point format comprises a sign bit, an 8-bitexponent, and a mantissa comprising 7 explicit bits and an eighthimplicit bit.

Example 11 includes the substance of the exemplary method of Example 8,wherein N is specified by the instruction and has a value in someembodiments equaling any one of 4, 8, and 16 (but the invention does notplace an upper limit on N, which could be 32, 64, or larger, andassociated with source vectors having 1024, 2048, or more bits.).

Example 12 includes the substance of the exemplary method of Example 8,wherein the execution circuitry is to perform the multiplications withinfinite precision without saturation and to saturate the results of theaccumulation to plus or minus infinity in case of an overflow and tozero in case of any underflow.

Example 13 includes the substance of the exemplary method of Example 8,wherein the 16-bit floating-point format is either bfloat16 or binary16.

Example 14 includes the substance of the exemplary method of Example 8,wherein the execution circuitry is to generate all N elements of thespecified destination in parallel.

Example 15 provides an exemplary system comprising a memory and aprocessor, the processor comprising: fetch circuitry to fetch aninstruction having fields to specify an opcode and locations of firstsource, second source, and destination vectors, the opcode to indicateexecution circuitry is to multiply N pairs of 16-bit floating-pointformatted elements of the specified first and second sources, andaccumulate the resulting products with previous contents of acorresponding single-precision element of the specified destination;decode circuitry to decode the fetched instruction; and executioncircuitry to respond to the decoded instruction as specified by theopcode.

Example 16 includes the substance of the exemplary system of Example 15,wherein the locations of each of the specified source and destinationvectors are either in registers in the processor or in the memory.

Example 17 includes the substance of the exemplary system of Example 15,wherein the 16-bit floating-point format comprises either a 5-bitexponent or an 8-bit exponent.

Example 18 provides an exemplary method to be performed by a processor,the method comprising: fetching, using fetch circuitry, an instructionhaving fields to specify an opcode and locations of first source, secondsource, and destination vectors, the opcode to indicate the processor isto multiply N pairs of 16-bit floating-point formatted elements of thespecified first and second sources, and accumulate the resultingproducts with previous contents of a corresponding single-precisionelement of the specified destination; decoding, using decode circuitry,the fetched instruction; and responding to the decoded instruction asspecified by the opcode with execution circuitry.

Example 19 includes the substance of the exemplary non-transitorymachine-readable medium of Example 18, wherein the instruction furtherincludes a field to specify N, wherein N in some embodiments equals anyone of 4, 8, and 16 (but the invention does not place an upper limit onN, which could be 32, 64, or larger, and associated with source vectorshaving 1024, 2048, or more bits.), and wherein the execution circuitryis to generate all N elements of the specified destination in parallel.

Example 20 includes the substance of the exemplary non-transitorymachine-readable medium of Example 18, wherein the execution circuitryis to perform the multiplications with infinite precision withoutsaturation and to saturate the result of the accumulation to plus orminus infinity in case of an overflow and to zero in case of anyunderflow.

What is claimed is:
 1. A processor comprising: fetch circuitry to fetcha single instruction having fields to specify an opcode and locations offirst source, second source, and destination vectors, the opcode toindicate execution circuitry is to multiply N pairs of elements of thespecified first and second sources having a 16-bit floating-point formatof a sign bit, an 8-bit exponent, and a mantissa comprising 7 explicitbits and an eighth implicit bit, and accumulate resulting products withprevious contents of a corresponding single-precision element of thespecified destination according to a rounding mode fixed for the singleinstruction regardless of any rounding mode set in a control register;decode circuitry to decode the fetched instruction; and the executioncircuitry to respond to the decoded instruction as specified by theopcode.
 2. The processor of claim 1, wherein the locations of each ofthe specified source and destination vectors are either in registers orin memory.
 3. The processor of claim 1, wherein N is specified by theinstruction and has a value of one of 4, 8, 16, and
 32. 4. The processorof claim 1, wherein the execution circuitry is to perform themultiplications without saturation and to saturate the result of theaccumulation to plus or minus infinity in case of an overflow and tozero in case of any underflow.
 5. The processor of claim 1, wherein the16-bit floating-point format is bfloat16.
 6. The processor of claim 1,wherein the execution circuitry is to generate all N elements of thespecified destination in parallel.
 7. A method comprising: fetching,using fetch circuitry, a single instruction having fields to specify anopcode and locations of first source, second source, and destinationvectors, the opcode to indicate execution circuitry is to multiply Npairs of elements of the specified first and second sources having a16-bit floating-point format of a sign bit, an 8-bit exponent, and amantissa comprising 7 explicit bits and an eighth implicit bit, andaccumulate resulting products with previous contents of a correspondingsingle-precision element of the specified destination according to arounding mode fixed for the single instruction regardless of anyrounding mode set in a control register; decoding, using decodecircuitry, the fetched instruction; and responding to the decodedinstruction as specified by the opcode with the execution circuitry. 8.The method of claim 7, wherein the locations of each of the specifiedsource and destination vectors are either in registers or in memory. 9.The method of claim 7, wherein N is specified by the instruction and hasa value of one of 4, 8,
 16. 10. The method of claim 7, wherein theexecution circuitry is to perform the multiplications without saturationand to saturate the result of the accumulation to plus or minus infinityin case of an overflow and to zero in case of any underflow.
 11. Themethod of claim 7, wherein the 16-bit floating-point format is bfloat16.12. The method of claim 7, wherein the execution circuitry is togenerate all N elements of the specified destination in parallel.
 13. Asystem comprising: a memory; and a processor coupled to the memory, theprocessor comprising: fetch circuitry to fetch a single instructionhaving fields to specify an opcode and locations of first source, secondsource, and destination vectors, the opcode to indicate executioncircuitry is to multiply N pairs of elements of the specified first andsecond sources having a 16-bit floating-point format of a sign bit, an8-bit exponent, and a mantissa comprising 7 explicit bits and an eighthimplicit bit, and accumulate resulting products with previous contentsof a corresponding single-precision element of the specified destinationaccording to a rounding mode fixed for the single instruction regardlessof any rounding mode set in a control register; decode circuitry todecode the fetched instruction; and the execution circuitry to respondto the decoded instruction as specified by the opcode.
 14. The system ofclaim 13, wherein the locations of each of the specified source anddestination vectors are either in registers in the processor or in thememory.
 15. The system of claim 13, wherein the 16-bit floating-pointformat is bfloat16.
 16. A non-transitory machine-readable mediumcontaining code to cause a processor to respond by: fetching, usingfetch circuitry, a single instruction having fields to specify an opcodeand locations of first source, second source, and destination vectors,the opcode to indicate the processor is to multiply N pairs of elementsof the specified first and second sources having a 16-bit floating-pointformat of a sign bit, an 8-bit exponent, and a mantissa comprising 7explicit bits and an eighth implicit bit, and accumulate resultingproducts with previous contents of a corresponding single-precisionelement of the specified destination according to a rounding mode fixedfor the single instruction regardless of any rounding mode set in acontrol register; decoding, using decode circuitry, the fetchedinstruction; and responding to the decoded instruction as specified bythe opcode with execution circuitry.
 17. The non-transitorymachine-readable medium of claim 16, wherein the instruction furtherincludes a field to specify N, wherein N is an even number larger than4.
 18. The non-transitory machine-readable medium of claim 16, whereinthe execution circuitry is to perform the multiplications withoutsaturation and to saturate the result of the accumulation to plus orminus infinity in case of an overflow and to zero in case of anyunderflow.
 19. The non-transitory machine-readable medium of claim 16,wherein the 16-bit floating-point format is bfloat16.